Using the fingerprint to the elliptic curve cryptosystems
نویسندگان
چکیده
منابع مشابه
Efficient elliptic curve cryptosystems
Elliptic curve cryptosystems (ECC) are new generations of public key cryptosystems that have a smaller key size for the same level of security. The exponentiation on elliptic curve is the most important operation in ECC, so when the ECC is put into practice, the major problem is how to enhance the speed of the exponentiation. It is thus of great interest to develop algorithms for exponentiation...
متن کاملElliptic Curve Cryptosystems
We discuss analogs based on elliptic curves over finite fields of public key cryptosystems which use the multiplicative group of a finite field. These elliptic curve cryptosystems may be more secure, because the analog of the discrete logarithm problem on elliptic curves is likely to be harder than the classical discrete logarithm problem, especially over GF(2"). We discuss the question of prim...
متن کاملImplementing Elliptic Curve Cryptosystems
In 1987 Neil Koblitz first suggested the use of Elliptic curves for Public Key Cryptosystems. This has triggered publications about ECC (Elliptic Curve Cryptography) in recent years as well as the appearance of first University textbooks about that topic. Some Mathematicians and Computer Scientists have focused their studies of Elliptic curves on efficiency and security of ECC. Questions arise ...
متن کاملElliptic Curve Cryptosystems; Too Good to Be True? Overzichtsartikel Elliptic Curve Cryptosystems
Er bestaan vele publieke-sleutel cryptosystemen. Het vakgebied is sterk in beweging en wordt gekenmerkt door hevige controverses. Dat is logisch, want met het beveiligen van gegevens zijn grote commerciële belangen gemoeid. Op het Mathematisch Congres 2001 in Amsterdam presenteerde Eric Verheul (Pricewaterhouse Coopers) in een van de hoofdvoordrachten het cryptosysteem gebaseerd op de discrete ...
متن کاملOn the Implementation of Elliptic Curve Cryptosystems
A family of elliptic curves for cryptographic use is proposed for which the determination of the order of the corresponding algebraic group is much easier than in the general case. This makes it easier to meet the cryptographic requirement that this order have a large prime factor. Another advantage of this farniliy is that the group operation simplifies slightly. Explicit numerical examples ar...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Ukrainian Scientific Journal of Information Security
سال: 2012
ISSN: 2411-071X,2225-5036
DOI: 10.18372/2225-5036.17.3394